An introduction to the two‐dimensional rectangular cutting and packing problem

نویسندگان

چکیده

Cutting and packing problems have been widely studied in the last decades, mainly due to variety of industrial applications where emerge. This paper presents an overview solution approaches that proposed for solving two-dimensional rectangular cutting problems. The main emphasis this work is on two distinct belong problem family. first aims place onto object maximum-profit subset items, is, output maximization, while second one all items using as few identical objects possible, input minimization. objective not be exhaustive but provide a solid grasp by describing their most important approaches.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ترجمه و تحقیق کتاب an introduction to the history of mysticism

پایان نامه ی ارائه شده ترجمه ی کتاب «an introduction to the history of mysticism» نوشته ی مارگارت اسمیت که وی پژوهشگر، خاورشناس و محقق برجسته ی تصوف و عرفان می باشد. موضوع اساسی و مهم این کتاب عرفان در ادیان مختلف است. نویسنده در ابتدا این کلمه را ریشه یابی کرده و سپس تعریفی از آن ارائه داده و آن را در ادیان مختلف مورد بحث قرار داده است و در هر فصل کتاب به معرفی عرفای آن دین یا عصر خاصی پرداخته...

15 صفحه اول

Problem Generators for Rectangular packing problems

In order to verify and test the performance of new packing algorithms relative to existing algorithms, test problems are needed. The scope of published test instances for 2D rectangular and irregular packing has been fairly limited in terms of object size, number and dimension of items. A systematic investigation into the performance of new algorithms requires the use of a range of test problem...

متن کامل

A Hybrid Heuristic Algorithm for the Rectangular Packing Problem

A hybrid heuristic algorithm for the two-dimensional rectangular packing problem is presented. This algorithm is mainly based on divide-andconquer and greedy strategies. The computational results on a class of benchmark problems have shown that the performance of the heuristic algorithm can outperform that of quasi-human heuristics.

متن کامل

A Meta-heuristic Algorithm for the Strip Rectangular Packing Problem

A new meta-heuristic algorithm to find the minimum height for twodimensional strip rectangular packing problem is presented. This algorithm is mainly based on the heuristic recursive strategy and simulated annealing algorithm. The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than known meta-heuristic but also runs in shorter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Transactions in Operational Research

سال: 2022

ISSN: ['1475-3995', '0969-6016']

DOI: https://doi.org/10.1111/itor.13236